Time-Efficient State-Space Search

Efficient State Space Search for Time Petri Nets

Time-eecient State Space Search

We present two time-e cient state space algorithms for searching minimax trees. Because they are based on SSS* and Dual*, both dominate Alpha-Beta on a node count basis. Moreover, one of them is always faster in searching random trees, even when the leaf node evaluation time is negligible. The fast execution time is attributed to the recursive nature of our algorithms and to their e cient data ...

Efficient Coverage Directed State Space Search

On multiprocessor task scheduling using efficient state space search approaches

Obtaining an optimal schedule for a set of precedence-constrained tasks is a well-known NP-complete problem in its general form. In view of the intractability of the problem, most of the previous work relies on heuristics that try to find reasonably high quality solutions in an acceptable amount of time. While optimal polynomial-time algorithms are known only for a few simple cases (and in othe...

Phased State Space Search

PS*, a new sequential tree searching algorithm based on the State Space Search (SSS*), is presented. PS*(k) divides each MAX node of a game tree into k partitions, which are then searched in sequence. By this means two major disadvantages of SSS*, storage demand and maintenance overhead, are significantly reduced, and yet the corresponding increase in nodes visited is not so great even in the r...